runtime.mheap.arenas (field)

29 uses

	runtime (current package)
		heapdump.go#L526: 	for i1 := range mheap_.arenas {
		heapdump.go#L527: 		if mheap_.arenas[i1] == nil {
		heapdump.go#L530: 		for i, ha := range mheap_.arenas[i1] {
		malloc.go#L854: 		l2 := h.arenas[ri.l1()]
		malloc.go#L873: 			atomic.StorepNoWB(unsafe.Pointer(&h.arenas[ri.l1()]), unsafe.Pointer(l2))
		malloc.go#L955: 	for i := range h.arenas {
		malloc.go#L956: 		l2 := (*[1 << arenaL2Bits]*heapArena)(atomic.Loadp(unsafe.Pointer(&h.arenas[i])))
		mcheckmark.go#L43: 		arena := mheap_.arenas[ai.l1()][ai.l2()]
		mcheckmark.go#L109: 	arena := mheap_.arenas[ai.l1()][ai.l2()]
		mcheckmark.go#L303: 		ha := mheap_.arenas[ai.l1()][ai.l2()]
		mgc.go#L2127: 		ha := mheap_.arenas[ai.l1()][ai.l2()]
		mgcmark.go#L414: 	ha := mheap_.arenas[ai.l1()][ai.l2()]
		mheap.go#L150: 	arenas [1 << arenaL1Bits]*[1 << arenaL2Bits]*heapArena
		mheap.go#L705: 		if ri.l2() >= uint(len(mheap_.arenas[0])) {
		mheap.go#L710: 		if ri.l1() >= uint(len(mheap_.arenas)) {
		mheap.go#L714: 	l2 := mheap_.arenas[ri.l1()]
		mheap.go#L733: 	return mheap_.arenas[ai.l1()][ai.l2()].spans[(p/pageSize)%pagesPerArena]
		mheap.go#L759: 	arena = mheap_.arenas[ai.l1()][ai.l2()]
		mheap.go#L770: 		if ri.l2() >= uint(len(mheap_.arenas[0])) {
		mheap.go#L775: 		if ri.l1() >= uint(len(mheap_.arenas)) {
		mheap.go#L779: 	l2 := mheap_.arenas[ri.l1()]
		mheap.go#L928: 		ha := h.arenas[ai.l1()][ai.l2()]
		mheap.go#L1051: 	ha := h.arenas[ai.l1()][ai.l2()]
		mheap.go#L1056: 			ha = h.arenas[ai.l1()][ai.l2()]
		mheap.go#L1075: 		ha := h.arenas[ai.l1()][ai.l2()]
		mheap.go#L1985: 	ha := mheap_.arenas[ai.l1()][ai.l2()]
		mheap.go#L1993: 	ha := mheap_.arenas[ai.l1()][ai.l2()]
		mpagealloc.go#L624: 	if p.test || mheap_.arenas[ai.l1()] == nil || mheap_.arenas[ai.l1()][ai.l2()] == nil {